Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
91	Algorithms and Hardness for Subspace Approximation Amit Deshpande∗ Madhur Tulsiani† Nisheeth K. Vishnoi‡ Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2011-10-12 09:49:14
92	Approximation Algorithms and Hardness of Integral Concurrent Flow ∗ Parinya Chalermsook† Julia Chuzhoy ‡ Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2012-05-23 11:17:06
93	APPROX 2013 and RANDOM 2013 16th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2013 & 17th Intl. Workshop on Randomization and Computation RANDOM 2013 http://cui.unige.ch/tcs/r Add to Reading List Source URL: cui.unige.ch Language: English - Date: 2015-06-12 14:26:15
94	Minimum sum multicoloring on the edges of trees Dániel Marx Budapest University of Technology and Economics Workshop on Approximation and Online Algorithms Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2007-10-29 10:18:34
95	Survey of connections between approximation algorithms and parameterized complexity Dániel Marx Tel Aviv University, Israel Dagstuhl Seminar 09511 Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2010-01-12 10:13:14
96	Cartesian Coordinates Z-matrix or internal coordinates A rough geometrical approximation – used often with minimization algorithms where initial geometry will be “fixed” by minimizing the E Steps to constructing Add to Reading List Source URL: iqscience.richmond.edu Language: English - Date: 2015-04-10 09:49:50
97	Approximation Algorithms and Hardness of the k-Route Cut Problem∗ Julia Chuzhoy† Yury Makarychev‡ Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2011-12-15 13:20:22
98	Survey of connections between approximation algorithms and parameterized complexity Dániel Marx Humboldt-Universität zu Berlin, Germany Dagstuhl Seminar 11091: Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2011-02-28 08:36:55
99	Local Constraints in Combinatorial Optimization Madhur Tulsiani Institute for Advanced Study Local Constraints in Approximation Algorithms Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2011-10-12 09:49:34
100	Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23 Computational complexity theory Theory of computation Complexity classes Packing problems NP-complete problems Bin packing problem Approximation algorithms Polynomial-time approximation scheme Partition problem NP NC Time complexity

UPDATE